| Modulekode | WTW 285 |
| Kwalifikasie | Undergraduate |
| Fakulteit | Faculty of Natural and Agricultural Sciences |
| Module-inhoud | Setting up and solving recurrence relations. Equivalence and partial order relations. Graphs: paths, cycles, trees, isomorphism. Graph algorithms: Kruskal, Prim, Fleury. Finite state automata. |
| Modulekrediete | 12.00 |
| Programme | |
| Service modules | Faculty of Engineering, Built Environment and Information Technology |
| Prerequisites | WTW 115 |
| Contact time | 1 tutorial per week, 2 lectures per week |
| Language of tuition | Module is presented in English |
| Department | Mathematics and Applied Mathematics |
| Period of presentation | Semester 2 |
Copyright © University of Pretoria 2025. All rights reserved.
Virtual Campus
Get Social With Us
Download the UP Mobile App